$B$-valuations of graphs

α Valuations of Special Classes of Quadratic Graphs

Survey of certain valuations of graphs

The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.

Antimagic valuations of generalized Petersen graphs

A connected graph G is said to be (a, d)-antimagic, for some positive integers a and d, if its edges admit a labeling by the integers 1,2, ... , IE( G) I such that the induced vertex labels consist of an arithmetic progression with the first term a and the common difference d. In this paper we prove that the generalized Petersen graph P(n,2) is (3n2+6, 3)-antimagic for n == 0 (mod 4), n ~ B.

α valuations of special classes of quadratic graphs

Set-Valuations of Graphs and their Applications: A Survey

A set-valuation of a graph G = (V, E) assigns to the vertices or edges of G elements of the power set X 2 of a given nonempty set X subject to certain conditions and set-valuations have a variety of origins. Acharya defined a set-indexer of G to be an injective set-valuation X G V f 2 ) ( : → such that the induced set-valuation ) ( : G E f ⊕ X 2 → on the edges of G defined by ) ( ), ( ) ( ) ( G...